Modeling RNA Secondary Structures Using Tree Grammars

نویسندگان

  • Satoshi KOBAYASHI
  • Takashi YOKOMORI
چکیده

This paper proposes a grammatical tool, called tree adjunct grammar with tag for RNA ( denoted by TAG 2 RNA ), for representing secondary structures of RNAs, and shows some example TAG 2 RNA grammars for fairly complicated RNA secondary structures. We then demonstrate the appropriateness of the grammars for modeling RNA secondary structures by discussing its formal language and/or graph theoretic properties, including closure properties of TAG 2 RNA and graph planarity of secondary structures generated by TAG 2 RNA , the latter of which would provide a biologically reasonable constraint.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars

Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...

متن کامل

DNA Evolutionary Linguistics and RNA Structure Modeling : A Computational Approach

In this paper, we are concerned with analysing formal linguistic properties of DNA sequences in which a number of the language theoretic analysis on DNA sequences are established by means of computational methods. First, employing formal language theoretic framework, we consider a kind of an evolutionary problem of DNA sequences, asking (1) how DNA sequences were initially created and then evol...

متن کامل

Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling

Stochastic context-free grammar (SCFG) has been successful in modeling biomolecular structures, typically RNA secondary structure, for statistical analysis and structure prediction. Context-free grammar rules specify parallel and nested co-occurren-ces of terminals, and thus are ideal for modeling nucleotide canonical base pairs that constitute the RNA secondary structure. Stochastic grammars h...

متن کامل

The Weak Generative Capacity of Linear Tree-Adjoining Grammars

Linear tree-adjoining grammars (TAGs), by analogy with linear context-free grammars, are treeadjoining grammars in which at most one symbol in each elementary tree can be rewritten (adjoined or substituted at). Uemura et al. (1999), calling these grammars simple linear TAGs (SLTAGs), show that they generate a class of languages incommensurate with the context-free languages, and can be recogniz...

متن کامل

CCG-Based RNA Secondary Structure Prediction

Various systems have been proposed to predict secondary structures of RNAs using their sequence information. Among them, Uemura et al. [2] described a system that recognizes some typical RNA secondary structures such as hairpin loops and pseudoknots with Tree Adjoining Grammar. However, their work captures only known sub-structures, and not those unknown sub-structures that might also exist. Te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994